The walk on moving spheres: A new tool for simulating Brownian motion's exit time from a domain

نویسندگان

  • Madalina Deaconu
  • Samuel Herrmann
  • Sylvain Maire
چکیده

In this paper we introduce a new method for the simulation of the exit time and exit position of a δ-dimensional Brownian motion from a domain. The main interest of our method is that it avoids splitting time schemes as well as inversion of complicated series. The method, called walk on moving spheres algorithm, was first introduced for hitting times of Bessel processes. In this study this method is adapted and developed for the first time for the Brownian motion hitting times. The idea is to use the connexion between the δdimensional Bessel process and the δ-dimensional Brownian motion thanks to an explicit Bessel hitting time distribution associated with a particular curved boundary. This allows to build a fast and accurate numerical scheme for approximating the hitting time. We introduce also an overview of existing methods for the simulation of the Brownian hitting time and perform numerical comparisons with existing methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Rate of Convergence of the Walk on Spheres Algorithm

In this paper we examine the rate of convergence of one of the standard algorithms for emulating exit probabilities of Brownian motion, the Walk on Spheres (WoS) algorithm. We obtain a complete characterization of the rate of convergence of WoS in terms of the local geometry of a domain.

متن کامل

A Random Walk on Rectangles Algorithm

In this article, we introduce an algorithm that simulates efficiently the first exit time and position from a rectangle (or a parallelepiped) for a Brownian motion that starts at any point inside. This method provides an exact way to simulate the first exit time and position from any polygonal domain and then to solve some Dirichlet problems, whatever the dimension. This method can be used as a...

متن کامل

An Efficient Algorithm to Simulate a Brownian Motion Over Irregular Domains

In this paper, we present an algorithm to simulate a Brownian motion by coupling two numerical schemes: the Euler scheme with the random walk on the hyper-rectangles. This coupling algorithm has the advantage to be able to compute the exit time and the exit position of a Brownian motion from an irregular bounded domain (with corners at the boundary), and being of order one with respect to the t...

متن کامل

Space-time Random Walk for Stochastic Differential Equations in a Bounded Domain

A mean-square approximation, which ensures boundedness of both time and space increments, is considered for stochastic di erential equations in a bounded domain. The proposed algorithm is based on a space-time discretization using a random walk over boundaries of small space-time parallelepipeds. To realize the algorithm, exact distributions for exit points of the space-time Brownian motion fro...

متن کامل

Numerical Solution of the Robin Problem of Laplace Equations with a Feynman-Kac Formula and Reflecting Brownian Motions

In this paper, we present numerical methods to implement the probabilistic representation of third kind (Robin) boundary problem for the Laplace equations. The solution is based on a Feynman–Kac formula for the Robin problem which employs the standard reflecting Brownian motion (SRBM) and its boundary local time arising from the Skorokhod problem. By simulating SRBM paths through Brownian motio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematics and Computers in Simulation

دوره 135  شماره 

صفحات  -

تاریخ انتشار 2017